Performance Analysis of k-Ary n-Cube Interconnection Networks

An Analysis of Connectivity of k - ary n - cubem - diag Interconnection Networks

The diierence among diierent topologies in interconnection networks is a debated issue among highly parallel machine designers, since opposing parameters innuence the network performance. This paper presents a new model, k-ary n-cube m-diags, which generalizes existing k-ary n-cube topologies to include hexagonal networks and their n-dimensional extensions. A performance analysis based on this ...

Performance Analysis of k-ary n-cube Interconnection Networks

Performance Analysis of K-ary N-cube Interconnection Networks 12

VLSI communication networks are wire limited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-...

Power Constrained Design of Multiprocessor Interconnection Networks

[6] W. J. Dally, " Performance Analysis of k-ary n-cube interconnection networks, " IEEE Transactions on Computers, June 1990.

Extra connectivity measures of 3-ary n-cubes

The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...